Lossless Compression of Point Cloud Sequences Using Sequence Optimized CNN Models

نویسندگان

چکیده

In this paper we propose a new paradigm for encoding the geometry of dense point cloud sequences, where convolutional neural network (CNN), which estimates distributions, is optimized on several frames sequence to be compressed. We adopt lightweight CNN structures, perform training as part process and parameters are transmitted bitstream. The newly proposed scheme operates octree representation each cloud, consecutively resolution level. At every level, voxel grid traversed section-by-section (each section being perpendicular selected coordinate axis), in section, occupancies groups two-by-two voxels encoded at once single arithmetic coding operation. A context conditional distribution defined group based information available about occupancy neighboring current lower layers octree. probability mass functions patterns all from one four phases. phase, contexts updated with previous phase probabilities parallel, providing reasonable trade-off between parallelism processing informativeness contexts. time comparable spent remaining steps, leading competitive overall times. bitrates encoding-decoding times compare favorably those recently published compression schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless compression of video sequences

In this paper we investigate lossless compression schemes for video sequences A simple adaptive prediction scheme is presented that exploits temporal correlations or spectral correlations in addition to spatial correlations It is seen that even with motion compensation schemes that utilize only temporal correlations do not perform signif icantly better than schemes that utilize only spectral co...

متن کامل

Lossless Compression and Complexity of Chaotic Sequences

We investigate the complexity of short symbolic sequences of chaotic dynamical systems by using lossless compression algorithms. In particular, we study Non-Sequential Recursive Pair Substitution (NSRPS), a lossless compression algorithm first proposed by W. Ebeling et al. [Math. Biosc. 52, 1980] and Jiménez-Montaño et al. [arXiv:cond-mat/0204134, 2002]) which was subsequently shown to be optim...

متن کامل

Lossless Compression of Floating-Point Geometry

The geometric data sets found in scientific and industrial applications are often very detailed. Storing them using standard uncompressed formats results in large files that are expensive to store and slow to load and transmit. Many efficient mesh compression techniques have been proposed, but scientists and engineers often refrain from using them because they modify the mesh data. While connec...

متن کامل

Lossless compression of predicted floating-point geometry

The size of geometric data sets in scientific and industrial applications is constantly increasing. Storing surface or volume meshes in standard uncompressed formats results in large files that are expensive to store and slow to load and transmit. Scientists and engineers often refrain from using mesh compression because currently available schemes modify the mesh data. While connectivity is en...

متن کامل

Lossless Image Data Sequence Compression Using Optimal Context Quantization

Context based entropy coding often faces the conflict of a desire for large templates and the problem of context dilution. We consider the problem of finding the quantizer Q that quantizes the K-dimensional causal context Ci = (X ip t , , Xi-t2,. . , X i t K ) of a source symbol Xi into one of M conditioning states. A solution giving the minimum adaptive code length for a given data set is pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3197295